IDENTIFYING MALAGASY TREES

Identifying phylogenetic trees

A central problem that arises in evolutionary biology is that of displaying partitions of subsets of a finite set X on a tree whose vertices are partially labelled with the elements of X. Such a tree is called an X-tree and, for a collection C of partitions of subsets of X, characterisations for the existence and uniqueness of an X-tree that displays C have been previously given in terms of cho...

Identifying representative trees from ensembles.

Tree-based methods have become popular for analyzing complex data structures where the primary goal is risk stratification of patients. Ensemble techniques improve the accuracy in prediction and address the instability in a single tree by growing an ensemble of trees and aggregating. However, in the process, individual trees get lost. In this paper, we propose a methodology for identifying the ...

1-identifying Codes on Trees

Identifying diagnostic errors with induced decision trees.

OBJECTIVE The purpose of this article is to compare the diagnostic accuracy of induced decision trees with that of pruned neural networks and to improve the accuracy and interpretation of breast cancer diagnosis from readings of thin-needle aspirate by identifying cases likely to be misclassified by induced decision rules. METHOD Using an online database consisting of 699 cases of suspected b...

Identifying X-Trees with Few Characters

Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree T , there is a set of four characters that define T . Here we deal with the general case, where T is an arbitrary X-tree. We show that if d is the maximum degree of any vertex in T , then the minimum number of characters that identify T is log2 d (up to a small multiplicative constant).